Stochastic Hierarchical Multimodal Hub Location Problem for Cargo Delivery Systems: Formulation and Algorithm

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Single ‎A‎ssignment Capacitated Hierarchical Hub Set Covering Problem for Service Delivery Systems Over Multilevel Networks

The present study introduced a novel hierarchical hub set covering problem with capacity constraints. This study showed the significance of fixed charge costs for locating facilities, assigning hub links and designing a productivity network. The proposed model employs mixed integer programming to locate facilities and establish links between nodes according to the travel time between an origin-...

متن کامل

Multi-commodity Multimodal Splittable Logistics Hub Location Problem with Stochastic Demands

This study presents a multimodal hub location problem which has the capability to split commodities by limited-capacity hubs and transportation systems, based on the assumption that demands are stochastic for multi-commodity network flows. In the real world cases, demands are random over the planning horizon and those which are partially fulfilled, are lost. Thus, the present study handles dema...

متن کامل

Hierarchical multimodal hub location problem with time-definite deliveries

Hierarchical multimodal hub location problem is a cost-minimizing hub covering problem where two types of hubs and hub links, accounting for ground and air transportation, are to be established, while ensuring time-definite deliveries. We propose a mixed-integer programming formulation and perform a comprehensive sensitivity analysis on the Turkish network. We show that the locations of airport...

متن کامل

The Latest Arrival Hub Location Problem for Cargo Delivery Systems with Stopovers

In this paper, we concentrate on the service structure of ground-transportation based cargo delivery companies. The transient times that arise from nonsimultaneous arrivals at hubs (typically spent for unloading, loading, and sorting operations) can constitute a significant portion of the total delivery time for cargo delivery systems. The latest arrival hub location problem is a new minimax mo...

متن کامل

a bender’s decomposition algorithm for multi-objective hub location problem considering stochastic characteristics

in this paper, a multi-objective hub location problem considering stochastic links and candidate nodes characteristics is modeled. the first objective is to minimize total costs, including setup and transportation costs. the second one is to minimize network risks. characteristics such as weather conditions, safety, exchange rate, crisis, are defined as uncertainty parameters and considered as ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2020

ISSN: 2169-3536

DOI: 10.1109/access.2020.2981669